Characteristic polynomial and eigenvalues of anti-adjacency matrix of directed unicyclic corona graph
نویسندگان
چکیده
منابع مشابه
Adjacency matrix and characteristic polynomial of a derived voltage graph
In this article, we explain how to calculate the adjacency matrix and the characteristic polynomial of a derived voltage graph when the voltage group is abelian as presented in [1]. We then present a theorem for calculating the adjacency matrix of a derived voltage graph for any voltage group, abelian or non-abelian.
متن کاملOn the characteristic polynomial of the adjacency matrix of the subdivision graph of a graph
The characteristic polynomial of the adjacency matrix of a graph is noted in connection with a quantity characterizing the topological nature of structural isomers saturated hydrocarbons [S], a set of numbers that are the same for all graphs isomorphic to the graph, and others [l]. Many properties of the characteristic polynomials of the adjacency matrices of a graph and its line graph [3] have...
متن کاملDrawing Weighted Directed Graph from It's Adjacency Matrix
This paper proposes an algorithm for buUdmg weighted directed graph,defmes the weighted directed relationship matrix of the graph,an d describes algorithm implementation using this matrix.Based on this algorithm ,an effective way for building an d drawing weighted directed graphs is presented,forming a foundation for visual implementation of the algorithm in the graph theory.
متن کاملSIGNED GENERALIZED PETERSEN GRAPH AND ITS CHARACTERISTIC POLYNOMIAL
Let G^s be a signed graph, where G = (V;E) is the underlying simple graph and s : E(G) to {+, -} is the sign function on E(G). In this paper, we obtain k-th signed spectral moment and k-th signed Laplacian spectral moment of Gs together with coefficients of their signed characteristic polynomial and signed Laplacian characteristic polynomial are calculated.
متن کاملHow to Construct the Characteristic Polynomial of a Tree's Adjacency Matrix
We describe a simple, O(n 2 log(n)) algorithm to nd the characteristic polynomial of the adjacency matrix of any tree. An example is given showing the algorithm applied to a 13-vertex tree.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1836/1/012001